#include<iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <set>
#include <map>
using namespace std;
class Solution {
public:
    string multiply(string num1, string num2) {
        int ans[300];
        memset(ans, 0, sizeof ans);
        int n1 = num1.length(),n2= num2.length();
        for (int i =0; i < n1; i++)
        {
            for (int j = 0; j < n2; j++)
            {
                ans[i + j] += (num1[n1 - i - 1] - '0') * (num2[n2 - j - 1] - '0');
            }
        }
        string str="";
        int size=0;
        for (int i = 0; i <= n1 + n2; i++)
        {
            ans[i + 1] += ans[i] / 10;
            ans[i] %= 10;
            if (ans[i])size = i;
        }
        for (int i = size; i >= 0; i--)
        {
            str += to_string(ans[i]);
        }
        
        return str;
        
    }
};
int main()
{
    Solution sol;
}